/*
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <hash_map>
#include <set>
#include <vector>
#include <Stack>
#include <iostream>
#include <sstream>
using namespace std;
struct TreeNode {
	    int val;
	    TreeNode *left;
	    TreeNode *right;
	    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

bool isSameTree(TreeNode* p, TreeNode* q) {
	if(p==NULL&&q==NULL)
		return true;
	if(p&&!q||!p&&q||p->val!=q->val)
		return false;
	return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}

int main(){
	int a[]={1,3,-1,5,2,1};
	cout<<isScramble("great","rgtae");
	cout<<endl;
	system("pause");
}
*/